A Fault Resilient Routing Algorithm for Sparsely Connected 3D NoCs

نویسندگان

  • Masoumeh Ebrahimi
  • Ronak Salamat
  • Nader Bagherzadeh
  • Masoud Daneshtalab
چکیده

3D NoC has its outstanding advantages over 2D design such as the smaller footprint and the shorter global interconnects. However, vertical interconnects are expensive and prone to faults. It implies that 3D NoCs might be sparsely connected. Such non-fully connected 3D NoCs require proper routing algorithms to support the limited number of TSVs in the network where traditional algorithms such as dimension-order routing, XYZ, is not applicable anymore. In this paper, we propose a routing algorithm for the sparsely connected 3D NoCs with one, two and one virtual channels along the X, Y and Z dimensions, respectively. This algorithm is fault-resilient, meaning that it is functioning correctly for as long as there is at least one TSV in the right-most column of the network. Keywords-component: Fault Tolerance; Sparsely Connected Networks-on-Chip; 3D Design; Routing Algorithm

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Low Overhead Fault Reporting Scheme for Resilient 3D Network-on-Chip Applications

Recently three-dimensional Networks-on-Chips (3D NoCs) ranging from regular to highly irregular topologies have been realized as efforts to improve the performance of applications in both general purpose and application-specific multi-core domain. However, faults can cause high contentions in NoCs. As a solution, adaptive routing algorithms are used. On the other hand, these algorithms have hig...

متن کامل

FT-Z-OE: A Fault Tolerant and Low Overhead Routing Algorithm on TSV-based 3D Network on Chip Links

Three-dimensional Network-On-Chips (3D NOC) are the most efficient communication structures for complex multi-processor System-On-Chips (SOC). Such structures utilize short vertical interconnects in 3D ICs together with scalability of NOC to improve performance of communications in SOCs. By scaling trends in 3D integration, probability of fault occurrence increases that leads to low yield of li...

متن کامل

Optimal Path Diagnosis by Genetic Algorithm for NoCs

Nowadays Network-on-Chips is used instead of System-on-Chips for better performance. This paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.

متن کامل

Resilient routing implementation in 2D mesh NoC

With the rapid shrinking of technology and growing integration capacity, the probability of failures in Networks-on-Chip (NoCs) increases and thus, fault tolerance is essential. Moreover, the unpredictable locations of these failures may influence the regularity of the underlying topology, and a regular 2D mesh is likely to become irregular. Thus, for these failure-prone networks, a viable rout...

متن کامل

Research on Fault-tolerant Routing with High Success Probability in Mesh Interconnection Networks and Image

Mesh networks have been applied to build large scale multicomputer systems and Network-on-Chips (NoCs) extensively. Mesh networks perform poorly in tolerating faults in the view of worst-case analysis, so it is practically important for multicomputer systems and NoCs manufactures to determine that how much success probability to construct a fault-free path between two non-faulty nodes for the m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015